Transformational approach to program concretization
نویسندگان
چکیده
منابع مشابه
Towards a Transformational Approach to Program Verification
Although most typically used in other contexts, program transformations can simplify program veri-cation by transforming a program containing complex language features into a semantically equivalent program containing only simpler language features. The proof of the transformed program can then be performed using a set of proof rules for only the simpler features. There are tradeoos between the...
متن کاملThe Transformational Approach to Program Development
We present an overview of the program transformation techniques which have been proposed over the past twenty-five years in the context of logic programming. We consider the approach based on rules and strategies. First, we present the transformation rules and we address the issue of their correctness. Then, we present the transformation strategies and, through some examples, we illustrate thei...
متن کاملAdaptive Concretization for Parallel Program Synthesis
Program synthesis tools work by searching for an implementation that satisfies a given specification. Two popular search strategies are symbolic search, which reduces synthesis to a formula passed to a SAT solver, and explicit search, which uses brute force or random search to find a solution. In this paper, we propose adaptive concretization, a novel synthesis algorithm that combines the best ...
متن کاملAn empirical study of adaptive concretization for parallel program synthesis
Adaptive concretization is a program synthesis technique that enables efficient parallelization of challenging synthesis problems. The key observation behind adaptive concretization is that in a challenging synthesis problem, there are some unknowns that are best suited for explicit search and some that are best suited for symbolic search through constraint solving. At a high level, the main id...
متن کاملTransformational approach to transportation scheduling
We have used KIDS (Kestrel Interactive Development System) to derive extremely fast and accurate transportation schedulers from formal speciica-tions. As test data we use strategic transportation plans which are generated by U.S. government planners. In one such problem, the derived scheduler was able to schedule 15,460 individual movement requirements in 71 cpu seconds. The computed schedules ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 1991
ISSN: 0304-3975
DOI: 10.1016/0304-3975(91)90297-f